Batch codes from Hamming and Reed-Muller codes
نویسندگان
چکیده
منابع مشابه
Batch Codes from Hamming and Reed-Müller Codes
Batch codes, introduced by Ishai et al. encode a string $x \in \Sigma^{k}$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this...
متن کاملExtractors from Reed-Muller Codes
Finding explicit extractors is an important derandomization goal that has received a lot of attention in the past decade. This research has focused on two approaches, one related to hashing and the other to pseudorandom generators. A third view, regarding extractors as good error correcting codes, was noticed before. Yet, researchers had failed to build extractors directly from a good code, wit...
متن کاملRelative generalized Hamming weights of $q$-ary Reed-Muller codes
Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correction. In this paper we determine the relative generalized Hamming weights of these codes which can be translated into a detailed description of the i...
متن کاملQuantum Reed-Muller Codes
This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes. The code parameters are [[n, k, d]] = [[2, ∑r l=0 C(m, l) − ∑m−r−1 l=0 C(m, l), 2 m−r ]] where 2r + 1 > m > r.
متن کاملGeneralized Reed-Muller Codes
the possible choices for n and k are rather thinly distributed in the class of all pairs (n, k) with k ~ n--and it is, therefore, often inefficient to make use of such codes in concrete situations (that is, when a desired pair (n, k) is far from any achievable pair). We have succeeded in overcoming this difficulty by generalizing the Reed-Muller codes in such a way that they exist for every pai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2018
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.466634